Lower bound results on lengths of second-order formulas
نویسندگان
چکیده
منابع مشابه
Quantum Formulas: A Lower Bound and Simulation
We show that Nechiporuk’s method [26] for proving lower bounds for Boolean formulas can be extended to the quantum case. This leads to an Ω(n/ log n) lower bound for quantum formulas computing an explicit function. The only known previous explicit lower bound for quantum formulas [27] states that the majority function does not have a linear–size quantum formula. We also show that quantum formul...
متن کاملAn Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas
Haken proved that every resolution refutation of the pigeon hole formula has at least exponential size. Groote and Zantema proved that a particular OBDD computation of the pigeon hole formula has an exponential size. Here we show that any arbitrary OBDD refutation of the pigeon hole formula has an exponential size, too: we prove that the size of one of the intermediate OBDDs is at least Ω(1.025).
متن کاملOn some results of entire functions of two complex variables using their relative lower order
Some basic properties relating to relative lower order of entire functions of two complex variables are discussed in this paper.
متن کاملThe Good lower bound of Second-order nonlinearity of a class of Boolean function
In this paper we find the lower bound of second-order nonlinearity of Boolean function fλ(x) = Trn 1 (λx p) with p = 22r + 2r + 1, λ ∈ F2r and n = 5r. It is also demonstrated that the lower bound obtained in this paper is much better than the lower bound obtained by Iwata-Kurosawa [14], and Gangopadhyay et al. (Theorem 1, [12]).
متن کاملNew Lower Bound Formulas for Multicolored Ramsey Numbers
We give two lower bound formulas for multicolored Ramsey numbers. These formulas improve the bounds for several small multicolored Ramsey numbers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1985
ISSN: 0168-0072
DOI: 10.1016/0168-0072(85)90034-x